Algebraic solutions for the Fourier transform interrogator
نویسندگان
چکیده
A new method for fast, high resolution interrogation of an array photonic sensors is proposed. The technique based on the integrated Fourier transform (FT) interrogator previously introduced by authors. Compared to other interferometric interrogators, FT-interrogator very compact and has unprecedented tolerance variations in nominal values sensors’ resonance wavelength. In this paper, output voltages are written as a polynomial function complex variables whose modulus unitary argument encodes wavelength modulation sensors. Two different methods proposed solve system equations. both cases, Gröbner basis ideal computed using lexicographical monomial ordering, resulting polynomials variable contributions can be decoupled. Using NVidia graphics processing card, time 1 026 000 systems algebraic equations takes around 9 ms, which more than two orders magnitude faster Such performance allows real high-speed Multiple solutions satisfy equations, but, general, only one gives actual Other have been used optimization, leading reduction cross-talk among dynamic strain 1.66 n ε / H z .
منابع مشابه
GENERALIZATION OF TITCHMARSH'S THEOREM FOR THE GENERALIZED FOURIER-BESSEL TRANSFORM
In this paper, using a generalized translation operator, we prove theestimates for the generalized Fourier-Bessel transform in the space L2 on certainclasses of functions.
متن کاملEstimates for the Generalized Fourier-Bessel Transform in the Space L2
Some estimates are proved for the generalized Fourier-Bessel transform in the space (L^2) (alpha,n)-index certain classes of functions characterized by the generalized continuity modulus.
متن کاملFractional Fourier Transform Based OFDMA for Doubly Dispersive Channels
The performance of Orthogonal Frequency Division Multiple Access (OFDMA) system degrades significantly in doubly dispersive channels. This is due to the fact that exponential sub-carriers do not match the singular functions of this type of channels. To solve this problem, we develop a system whose sub-carriers are chirp functions. This is equivalent to exploiting Fractional Fourier Transform (F...
متن کاملFinite Fourier Transform, Circulant Matrices, and the Fast Fourier Transform
Suppose we have a function s(t) that measures the sound level at time t of an analog audio signal. We assume that s(t) is piecewise-continuous and of finite duration: s(t) = 0 when t is outside some interval a ≤ t ≤ b. Make a change of variable x = (t− a)/(b− a) and set f(x) = s(t). Then 0 ≤ x ≤ 1 when a ≤ t ≤ b, and f(x) is a piecewise continuous function of x. We convert f(x) into a digital s...
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2021
ISSN: ['1094-4087']
DOI: https://doi.org/10.1364/oe.426544